The chaos game on a general iterated function system
نویسنده
چکیده
The main theorem of this paper establishes conditions under which the ‘chaos game’ algorithm almost surely yields the attractor of an iterated function system. The theorem holds in a very general setting, even for non-contractive iterated function systems, and under weaker conditions on the random orbit of the chaos game than obtained previously.
منابع مشابه
Chaotic property for non-autonomous iterated function system
In this paper, the new concept of non-autonomous iterated function system is introduced and also shown that non-autonomous iterated function system IFS(f_(1,∞)^0,f_(1,∞)^1) is topologically transitive for the metric space of X whenever the system has average shadowing property and its minimal points on X are dense. Moreover, such a system is topologically transitive, whenever, there is a point ...
متن کاملThe Chaos Game on a General Iterated Function System from a Topological Point of View
We investigate combinatorial issues relating to the use of random orbit approximations to the attractor of an iterated function system with the aim of clarifying the role of the stochastic process during generation the orbit. A Baire category counterpart of almost sure convergence is presented; and a link between topological and probabilistic methods is observed.
متن کاملDiscrete Iterated Function Systems
discrete iterated function systems discrete iterated function systems representation of discrete sequences with dimensional discrete iterated function systems discrete iterated function systems stochastic discrete scale invariance: renormalization representation of discrete sequences with high-dimensional power domains and iterated function systems fractal tilings from iterated function systems...
متن کاملA Chaos game algorithm for generalized iterated function systems
In this paper we provide an extension of the classical Chaos game for IFSP. The paper is divided into two parts: in the first one, we discuss how to determine the integral with respect to a measure which is a combination of a self-similar measure from an IFSP along with a density given by an IFSM. In the second part, we prove a version of the Ergodic Theorem for the integration of a continuous ...
متن کاملChaos Games " for Iterated Function Systems withGrey Level
Two random iteration algorithms or \chaos games" for Iterated Function Systems on function spaces, namely IFS with grey level maps (IFSM), are described. The rst algorithm can be interpreted as a \chaos game in code space" and is guaranteed to work only in the case of nonoverlapping IFS maps. In the second algorithm, applicable to IFSM with overlapping IFS maps but aane grey level maps, the (no...
متن کامل